A note on using finite non-abelian p-groups in the MOR cryptosystem

نویسنده

  • Ayan Mahalanobis
چکیده

The MOR cryptosystem [9] is a natural generalization of the El-Gamal cryptosystem to non-abelian groups. Using a p-group, a cryptosystem was built in [4]. It seems resoanable to assume the cryptosystem is as secure as the El-Gamal cryptosystem over finite fields. A natural question arises can one make a better cryptosystem using p-groups? In this paper we show that the answer is no.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Simple Generalization of the Elgamal Cryptosystem to Non-abelian Groups

In this article we study the MOR cryptosystem. We use the group of unitriangular matrices over a finite field as the non-abelian group in the MOR cryptosystem. We show that a cryptosystem similar to the ElGamal cryptosystem over finite fields can be built using the proposed groups and a set of automorphisms of these groups. We also show that the security of this proposed MOR cryptosystem is equ...

متن کامل

A simple generalization of El-Gamal cryptosystem to non-abelian groups

In this paper we study the MOR cryptosystem. We use the group of unitriangular matrices over a finite field as the non-abelian group in the MOR cryptosystem. We show that a cryptosystem similar to the El-Gamal cryptosystem over finite fields can be built using the proposed groups and a set of automorphisms of these groups. We also show that the security of this proposed MOR cryptosystem is equi...

متن کامل

Design und Analyse kryptografischer Bausteine auf nicht-abelschen Gruppen

English Abstract Public-key cryptography enables two (or more) parties to execute cryptographic protocols (e.g. to send confidential messages) without requiring a common secret. The methods in use today are mostly based on abelian groups (see [35] for example). Recently, several cryptographic protocols using non-abelian groups were proposed [23, 42]. The underlying security assumption on which ...

متن کامل

MOR Cryptosystem and classical Chevalley groups in odd characteristic

In this paper we study the MOR cryptosystem with finite Chevalley groups. There are four infinite families of finite classical Chevalley groups. These are: special linear groups SL(d, q), orthogonal groups O(d, q) and symplectic groups Sp(d, q). The family O(d, q) splits to two different families of Chevalley groups depending on the parity of d. The MOR cryptosystem over SL(d, q) was studied by...

متن کامل

Security Analysis of the MOR Cryptosystem

The paper cryptanalyses a new public key cryptosystem that has been recently proposed by Paeng, Ha, Kim, Chee and Park [5]. The scheme works on finite non-abelian groups. We focus on the group SL(2, ZZp)×θ ZZp which was discussed in [5] extensively.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/cs/0702095  شماره 

صفحات  -

تاریخ انتشار 2007